Description: 用A星算法解决旅行商（货郎担）问题，附设计报告和测试用例-A Star algorithm used to solve TSP (traveling salesman) problems, with the design of reports and test cases Platform: |
Size: 60416 |
Author:杨猛 |
Hits:
Description: 货郎担算法一直是C++领域一个经典的算法，该源代码通过四种方法对货郎担算法进行了求解。-Traveling salesman algorithm has been C++ are the field of a classical algorithm, the source code through the four methods for solving the traveling salesman algorithm. Platform: |
Size: 3072 |
Author:黄鹏 |
Hits:
Description: 用来解决旅行商问题 可以直接运行 很好的代码-Used to solve the traveling salesman problem can be directly run a very good code Platform: |
Size: 2048 |
Author:罗兰 |
Hits:
Description: 这是一个蚁群算法的程序，通过求解旅行商tsp问题验证了算法的正确性-This is an ant colony algorithm procedure, by solving the traveling salesman problem tsp verify the correctness of the algorithm Platform: |
Size: 1024 |
Author:孙磊 |
Hits:
Description: tsp源程序 解决实际的旅行商问题 简单但是十分有用-tsp source code of the traveling salesman problem to solve real easy but very useful Platform: |
Size: 691200 |
Author:mp |
Hits:
Description: 遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题，具有重要的理论研究价值和实际应用背景。然而，传统遗传算法中存在有不足，需要提出新的改进的遗传算法，并应用于旅行商问题的求解。-Genetic algorithm is based on Darwin' s theory of evolution of an intelligent optimization algorithm, a complex system can be used to optimize the robustness of the search algorithm, the application of traditional methods to solve difficult and complex, nonlinear problems, can be widely used in combination optimization, discrete optimization, engineering, optimization and other fields. Traveling Salesman Problem is a NP hard combinatorial optimization problem, has important theoretical value and practical application of research background. However, the traditional genetic algorithm, there is less than the need to introduce new improved genetic algorithm, and applied for solving the traveling salesman problem. Platform: |
Size: 9216 |
Author:wangtao |
Hits:
Description: 参考文章
遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题，具有重要的理论研究价值和实际应用背景。然而，传统遗传算法中存在有不足，需要提出新的改进的遗传算法，并应用于旅行商问题的求解。-Genetic Algorithm article reference Darwin' s theory of evolution is based on an intelligent optimization algorithm, a complex system can be used to optimize the robustness of the search algorithm, the application of traditional methods to solve difficult and complex, nonlinear problems, can be widely applied in combinatorial optimization, discrete optimization, engineering, optimization and other fields. Traveling Salesman Problem is a NP hard combinatorial optimization problem, has important theoretical value and practical application of research background. However, the traditional genetic algorithm, there is less than the need to introduce new improved genetic algorithm, and applied for solving the traveling salesman problem. Platform: |
Size: 99328 |
Author:wangtao |
Hits:
Description: 程序源代码
遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题，具有重要的理论研究价值和实际应用背景。然而，传统遗传算法中存在有不足，需要提出新的改进的遗传算法，并应用于旅行商问题的求解。-Genetic algorithm source code is based on Darwin' s theory of evolution of an intelligent optimization algorithm, a complex system can be used to optimize the robustness of the search algorithm, the application of traditional methods to solve difficult and complex, nonlinear problems, can be widely used in combinatorial optimization, discrete optimization, engineering, optimization and other fields. Traveling Salesman Problem is a NP hard combinatorial optimization problem, has important theoretical value and practical application of research background. However, the traditional genetic algorithm, there is less than the need to introduce new improved genetic algorithm, and applied for solving the traveling salesman problem. Platform: |
Size: 53248 |
Author:wangtao |
Hits:
Description: 修正后版本
遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题，具有重要的理论研究价值和实际应用背景。然而，传统遗传算法中存在有不足，需要提出新的改进的遗传算法，并应用于旅行商问题的求解。-Amended version of genetic algorithm based on Darwin' s theory of evolution is an intelligent optimization algorithm, a complex system can be used to optimize the robustness of the search algorithm, the application of traditional methods to solve difficult and complex, nonlinear problems, can be widely used in combinatorial optimization, discrete optimization, engineering, optimization and other fields. Traveling Salesman Problem is a NP hard combinatorial optimization problem, has important theoretical value and practical application of research background. However, the traditional genetic algorithm, there is less than the need to introduce new improved genetic algorithm, and applied for solving the traveling salesman problem. Platform: |
Size: 9216 |
Author:wangtao |
Hits:
Description: 使用模拟退火算法求解10城市和20城市的旅行商问题，城市数目和城市之间的距离保存在txt文件中，程序读入数据后求解最优路径-The use of simulated annealing algorithm 10 cities and 20 cities in the traveling salesman problem, the number of cities and the distance between the cities stored in the txt file, the program read the data to solve the optimal path Platform: |
Size: 614400 |
Author:郑益夫 |
Hits:
Description: 多旅行商问题(Multiple Traveling Salesperson Problem ,简称MTSP) 讨论的是如何安排m( > 1 ) 位旅行商访问n( >
m ) 座城市,要求每个城市只允许被访问一次时,求解所有旅行商花费的费用和是最小(或最大) 的问题。MTSP 问题其实与单
旅行商问题(Traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条
件,因而增加了问题复杂度。在以前使用遗传算法(GA) 研究解决MTSP 问题时,通常采用标准的TSP 染色体和处理方法。现
为解决MTSP 问题给出了一种新的染色体设计和相关的处理方法,并与以往的理论设计和计算性能进行比较。计算测试显
示,新的方法能够获得较小的查找空间,在许多方面,新的方法产生的解空间更好。-Multi-Traveling Salesman Problem (Multiple Traveling Salesperson Problem, referred to as MTSP) discussed the arrangements for the m (> 1)-bit traveling salesman visits n (>
m) cities to require each city to allow only visited once, the solution of traveling salesman to spend all the costs and the smallest (or largest) problems. In fact, with the single issue of MTSP
TSP (Traveling Salesperson Problem, referred to as TSP) is similar to, but added any city as long as the visit by a traveling salesman to be attached to the
Pieces, thus increasing the complexity of the problem. The use of genetic algorithms in the past (GA) to study and solve the issue of MTSP, usually a standard chromosome and the TSP approach. Is
MTSP problem to solve is given a new design and associated chromosome approach and the theory of the previous design and to compare performance. Calculation of the test significantly
Show that the new method can find a smaller space, in many respects, the new met Platform: |
Size: 247808 |
Author:liqiubin |
Hits:
Description: 给出了的整数线性规划模型、分类, 提出了均衡各旅行商访问路程和均衡各旅行商访问人数的多目标
问题针对均衡各旅行商访问路程的设计了相应的求解算法, 求解算法为遗传算法和一的混合算法给出了相应
的示例和实验结果, 并对实验结果的有效性进行了研究- Given integer linear programming model, classification, propose a balanced way to visit the traveling salesman traveling salesman and a balanced number of visitors to the multi-objective
The traveling salesman problem for a balanced design of a journey to visit the corresponding algorithm, algorithm for genetic algorithm and a hybrid algorithm of the corresponding
Examples and experimental results, the effectiveness of the experimental results were studied Traveling Salesmen Problem (MTSP). Numerical experiments show that the new algorithm is very efficient and effective. Platform: |
Size: 254976 |
Author:liqiubin |
Hits:
Description: 巨大的数据量使显示速度成为制约普及和网络化的重要因素，文章结合4(5’公司的607(84空间数据引擎，提出了一种利用分级技术提高矢量图显示速度的方案，并讨论了几种插值算法在这一应用中的优缺点。- W ith the ant colony algorithm for solving the traveling salesman problem (TSP) as a prototype, a simpli-
fied algorithm was developedwhich considered a capacity-constrained vehicle routing problem as several independent
TSPswith the depotserving as one of the cities in eachTSP. Pheromone updatewas analyzed and itwas found in the
searching process tha,t if the current solution is bestof all so far, then increase of the pheromone of the path found by the elitist ants further improves the solution and speed up the convergence. Moreover, allowingmore degree of
freedom at the initial stage results in better solution. Experimental results show that the simplified algorithm can efficiently find a satisfactory solution, with an error ofnomore than 1·5 of the optimal one.
Platform: |
Size: 83968 |
Author:砂登 |
Hits:
Description: 该程序是模拟退火算法应用中旅行商问题的c++程序-The procedure is the application of simulated annealing algorithm for the traveling salesman problem c++ program Platform: |
Size: 641024 |
Author:586 |
Hits:
Description: 求解tsp问题的遗传算法源代码。利用这个源程序可以更清晰的知道旅行商问题是如何实现最优化。-Solving the problem of genetic algorithm tsp source code. Take advantage of this source can be more clearly aware of the traveling salesman problem is how to achieve optimized. Platform: |
Size: 52224 |
Author:王竞婷 |
Hits:
Description: 旅行商问题的实现，用分支界限法实现旅行商问题-The realization of traveling salesman problem, and the Limits of Law branch of the realization of traveling salesman problem Platform: |
Size: 196608 |
Author:燃烧 |
Hits:
Description: 多旅行商问题是单旅行商问题的扩展, 具有更广泛的实际意义。在研究M TSP 解的特点的基础上, 提
出了最小化总行程和均分多个旅行商访问点数、最小化总行程及均分访问路程的两个多目标的M TSP 问题,
并分别给出了相应的数学模型、求解算法和应用实例, 实例表明模型的正确性。-Multi-traveling salesman problem traveling salesman problem is a single expansion, with a wider range of practical significance. M TSP in the study of the characteristics of solutions based on the smallest share of the total number of traveling salesman tour and visit the points, the smallest share of the total trip distance to visit more than two goals of the M TSP problem and were given the corresponding mathematical model, algorithm and application examples, examples show that the model is correct. Platform: |
Size: 242688 |
Author:Notics |
Hits:
Description: 介绍求解TSP 问题的蚁群算法，是解决旅行售货员问题的一种比较好的方法-Introduced to solve the ant colony algorithm for TSP problem is to solve the traveling salesman problem of a better way to Platform: |
Size: 67584 |
Author:vumeng |
Hits:
Search - the traveling salesman